A Generic Collapse Result for FO + poly Extended with aConnectivity Predicate ( Research in Progress )
نویسندگان
چکیده
We investigate the expressive limitations of FO +poly extended with a connectivity predicate, Conn.
منابع مشابه
Extended Order - Generic Queriesoleg
We consider relational databases organized over an ordered domain with some additional relations|a typical example is the ordered domain of rational numbers together with the operation of addition. In the focus of our study are the rst-order (FO) queries that are invariant under order-preserving \permutations"|such queries are called order-generic. It has recently been discovered that for some ...
متن کاملAdding a Path Connectedness Operator to FO + polyChris
The languages FO +poly and FO +linear have been proposed as a foundation for spatial database query languages. We extend both languages with a parameterised path-connectivity predicate, Pconn, to study spatial queries involving connectivity. We show that: FO +linear +Pconn; FO +poly +Pconn?2D, are closed and have NC data complexity, and FO + poly + Pconn ?3D is closed and has PTIME data complex...
متن کاملModel Checking FO(R) over One-Counter Processes and beyond
One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products of one-counter processes against 1) first-order logic FO(R) with reachability predicate, 2) the finite variable fragments FO(R) (k ≥ 2) of FO(R), 3) EF-logic which is a fragment of FO(R), and 4) all these logics extended with si...
متن کاملOn Query Languages for Linear Queries Definable with Polynomial Constraints
It has been argued that the linear database model in which semi linear sets are the only geometric objects is very suitable for most spatial database applications For querying linear databases the lan guage FO linear has been proposed We present both negative and positive results regarding the expressiveness of FO linear First we show that the dimension query is de nable in FO linear which allo...
متن کاملFirst-Order Logic vs. Fixed-Point Logic in Finite Set Theory
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has been established that either way of settling this conjecture would resolve open problems in complexity theory. In fact, this holds true even for the particular instance of the ordered conjecture on the class of BIT-stru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000